The Closed Fragment of IL is PSPACE Hard
نویسندگان
چکیده
In this paper we consider IL0, the closed fragment of the basic interpretability logic IL. We show that we can translate GL1, the one variable fragment of Gödel-Löb’s provabilty logic GL, into IL0. Invoking a result on the PSPACE completeness of GL1 we obtain the PSPACE hardness of IL0.
منابع مشابه
Complexity of the interpretability logic IL
We show that the decision problem for the basic system of interpretability logic IL is PSPACE– complete. For this purpose we present an algorithm which uses polynomial space with respect to the length of a given formula. The existence of such algorithm, together with the previously known PSPACE–hardness of the closed fragment of IL, implies PSPACE–completeness.
متن کاملContainment for Conditional Tree Patterns
A Conditional Tree Pattern (CTP) expands an XML tree pattern with labels attached to the descendant edges. These labels can be XML element names or Boolean CTP’s. The meaning of a descendant edge labelled by A and ending in a node labelled by B is a path of child steps ending in a B node such that all intermediate nodes are A nodes. In effect this expresses the until B, A holds construction fro...
متن کاملBranching-Time Model Checking of One-Counter Processes and Timed Automata
One-counter automata (OCA) are pushdown automata which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CTL) on transition systems induced by one-counter automata. A PSPACE upper bound is inherited from the modal μ-calculus for this problem proven by Serre. First, we analyze the periodic behaviour of CTL over OCA and derive ...
متن کاملComputational complexity of diagram satisfaction in Euclidean geometry
In this paper, it is shown that the problem of deciding whether or not a geometric diagram in Euclidean Geometry is satisfiable is NP-hard and in PSPACE, and in fact has the same complexity as the satisfaction problem for a fragment of the existential theory of the real numbers. The related problem of finding all of the possible (satisfiable) diagrams that can result when a segment of a diagram...
متن کاملThe consequence relation in the logic of commutative GBL-algebras is PSPACE-complete
Commutative, integral and bounded GBL-algebras form a subvariety of residuated lattices which provides the algebraic semantics of an interesting common fragment of intuitionistic logic and of several fuzzy logics. It is known that both the equational theory and the quasiequational theory of commutative GBL-algebras are decidable (in contrast to the noncommutative case), but their complexity has...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 278 شماره
صفحات -
تاریخ انتشار 2011